Exploring Application%2DLevel Semantics for Data Compression.

Selective data acquisition for probabilistic K%2DNN query.

SocialCRC a social%2D and context%2Daware rendezvous coordination system.

Selective data acquisition for probabilistic K%2DNN query.

A two%2Dphase hybrid codebook generation technique for vector quantization.

Human Action Recognition Using Key Points Displacement.

Privacy%2Dpreserving outsourcing support vector machines with random transformation.

k%2DSupport anonymity based on pseudo taxonomy for outsourcing of frequent itemset mining.


DPSP Distributed Progressive Sequential Pattern Mining on the Cloud.


Convenience probe a participatory sensing tool to collect large%2Dscale consumer flow behaviors.
This paper proposes Convenience Probe, a participatory sensing tool to collect large-scale consumer flow behaviors from everyday mobile phones. We hope to use Convenience Probe to collect real consumer flow data that will help convenience store chains in store location assessment.
Data Selection for Exact Value Acquisition to Improve Uncertain Clustering.

Density Conscious Subspace Clustering for High%2DDimensional Data.

Dynamic Wavelet Synopses Management over Sliding Windows in Sensor Networks.

A General Framework of Time%2DVariant Bandwidth Allocation in the Data Broadcasting Environment.

An Asymmetric and Asynchronous Energy Conservation Protocol for Vehicular Networks.

Intention%2Dfocused active reranking for image object retrieval.

Incremental SVM Model for Spam Detection on Dynamic Email Social Networks.

PROUD a probabilistic approach to processing similarity queries over uncertain data streams.

Time%2DCritical Data Dissemination in Cooperative Peer%2Dto%2DPeer Systems.
Abstract—How to rapidly disseminate a large-sized file to many recipients is a fundamental problem in many applications, such as updating software patches and distributing large scientific data sets. In this paper, we present the Bee protocol, which is a cooperative peer-to-peer data dissemination protocol aiming at minimizing the maximum dissemination time for all peers to obtain time-critical data, such as critical patch updates. Bee is a decentralized protocol that organizes peers into a randomized mesh-based overlay and each peer only works with local knowledge. We devise a slowest peer first strategy to boost the speed of dissemination, and a topology adaptation algorithm that provides the most efficient utilization of the network capacity. Bee is designed to support network heterogeneity and deal with the flash crowd arrival pattern without sacrificing the dissemination speed. We present experimental results on the performance of Bee in terms of dissemination time and show that its performance can approach lower bound of the maximum dissemination time. I.
Language%2Dmodel%2Dbased detection cascade for efficient classification of image%2Dbased spam e%2Dmail.

AAA Asynchronous

On the Energy Efficiency for Heterogeneous Data Broadcasting.

An adaptive threshold framework for event detection using HMM%2Dbased life profiles.

Reducing Redundancy in Subspace Clustering.

Online Scheduling Sequential Objects with Periodicity for Dynamic Information Dissemination.

On the Design and Applicability of Distance Functions in High%2DDimensional Data Space.

Catching the Trend A Framework for Clustering Concept%2DDrifting Categorical Data.

Data Broadcast with Adaptive Network Coding in Heterogeneous Wireless Networks.

On Channel Allocation for Heterogeneous Data Broadcasting.

On designing a shortest%2Dpath%2Dbased cache replacement in a transcoding proxy.

Feature%2Dpreserved sampling over streaming data.

Efficient web matrix processing based on dual reordering.

A novel email abstraction scheme for spam detection.

Fully Adaptive Power Saving Protocols for Ad Hoc Networks Using the Hyper Quorum System.

A Novel Language%2DModel%2DBased Approach for Image Object Mining and Re%2Dranking.

Releasing the SVM Classifier with Privacy%2DPreservation.

Recommending personalized scenic itinerarywith geo%2Dtagged photos.

Visual%2Dword%2Dbased duplicate image search with pseudo%2Drelevance feedback.

Asymmetric support vector machines low false%2Dpositive learning under the user tolerance.

Multi%2Ddata Delivery Based on Network Coding in On%2Ddemand Broadcast.

PAID Packet Analysis for Anomaly Intrusion Detection.

Mining Quality%2DAware Subspace Clusters.

PAID Packet Analysis for Anomaly Intrusion Detection.

On Data Labeling for Clustering Categorical Data.

On Data Labeling for Clustering Categorical Data.

Toward the Optimal Itinerary%2DBased KNN Query Processing in Mobile Sensor Networks.

Hardware%2DEnhanced Association Rule Mining with Hashing and Pipelining.

On Bandwidth%2DEfficient Data Broadcast.
The proliferation of new data-intensive applications in asymmetric communication environments has led to an increasing interest in the development of push-based techniques, in which the information is broadcast to a large population of clients in order to achieve the most efficient use of the limited server and communication resources. It is important to note that quite often the data that is broadcast is time-critical in nature. Most of the related current research focuses on a pure push-based approach (Broadcast Disks model), where the transmission of data is done without allowing explicit requests from the users. More recently, some bidirectional models incorporating a low-capacity uplink channel have been proposed in order to increase the functionality of the Broadcast Disks model. However, the impact of integration of the uplink channel has been investigated using only static client profiles or ignoring the existence of timing constraints associated with data. None of the existing...
A General Model for Sequential Pattern Mining with a Progressive Database.

Bandwidth Efficient Video Multicasting in Multiradio Multicellular Wireless Networks.

Bandwidth Efficient Video Multicasting in Multiradio Multicellular Wireless Networks.

Efficient Resource Allocation for Wireless Multicast.
Abstract—In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet Protocol (IP) multicast tree by adaptively selecting the cell and the wireless technology for each mobile host to join the multicast group. Our mechanism enables more mobile hosts to cluster together and leads to the use of fewer cells to save the scarce wireless bandwidth. Besides, the paths in the multicast tree connecting to the selected cells share more common links to save the wireline bandwidth. Our mechanism supports the dynamic group membership and offers mobility of group members. Moreover, our mechanism requires no modification to the current IP multicast routing protocols. We formulate the selection of the cell and the wireless technology for each mobile host in the heterogeneous wireless networks as an optimization problem. We use Integer Linear Programming to model the problem and show that the problem is NP-hard. To solve the problem, we propose a distributed algorithm based on Lagrangean relaxation and a network protocol based on the algorithm. The simulation results show that our mechanism can effectively save the wireless and wireline bandwidth as compared to the traditional IP multicast. Index Terms—Heterogeneous wireless networks, multicast. Ç 1
Association and Temporal Rule Mining for Post%2DFiltering of Semantic Concept Detection in Video.
Abstract—Automatic semantic concept detection in video is important for effective content-based video retrieval and mining and has gained great attention recently. In this paper, we propose a general post-filtering framework to enhance robustness and accuracy of semantic concept detection using association and temporal analysis for concept knowledge discovery. Co-occurrence of several semantic concepts could imply the presence of other concepts. We use association mining techniques to discover such inter-concept association relationships from annotations. With discovered concept association rules, we propose a strategy to combine associated concept classifiers to improve detection accuracy. In addition, because video is often visually smooth and semantically coherent, detection results from temporally adjacent shots could be used for the detection of the current shot. We propose temporal filter designs for inter-shot temporal dependency mining to further improve detection accuracy. Experiments on the TRECVID 2005 dataset show our post-filtering framework is both efficient and effective in improving the accuracy of semantic concept detection in video. Furthermore, it is easy to integrate our framework with existing classifiers to boost their performance. Index Terms—Semantic concept detection, association rule mining, temporal rule mining, post-filtering, content-based video retrieval and mining. I.
LeeWave level%2Dwise distribution of wavelet coefficients for processing kNN queries over distributed streams.

DAWN an efficient framework of DCT for data with error estimation.

Efficient algorithms for incremental Web log mining with dynamic thresholds.

Power%2Dlaw relationship and self%2Dsimilarity in the itemset support distribution analysis and applications.

Mining top%2Dk frequent patterns in the presence of the memory constraint.

Dependency of Constrained Clustering of Transaction Data on Known Data Distribution.

Image stablization for 2D barcode in handheld devices.

Dependency of Constrained Clustering of Transaction Data on Known Data Distribution.

Using Network Coding for Dependent Data Broadcasting in a Mobile Environment.

An Asymmetric Quorum%2Dbased Power Saving Protocol for Clustered Ad Hoc Networks.

DIKNN An Itinerary%2Dbased KNN Query Processing Algorithm for Mobile Sensor Networks.

Extracting Barcodes from a Camera%2DShaken Image on Camera Phones.

The Temporal Summarization of News Topics Using Eigenvectors of Symmetric Matrices.

Variant Bandwidth Channel Allocation in the Data Broadcasting Environment.

Incremental Clustering in Geography and Optimization Spaces.

Exploring Group Moving Pattern for an Energy%2DConstrained Object Tracking Sensor Network.

ProMail Using Progressive Email Social Network for Spam Detection.

MULS A General Framework of Providing Multilevel Service Quality in Sequential Data Broadcasting.

Clustering over Multiple Evolving Streams by Events and Correlations.

Efficient Process of Top%2Dk Range%2DSum Queries over Multiple Streams with Minimized Global Error.

MULS A General Framework of Providing Multilevel Service Quality in Sequential Data Broadcasting.

Approximate Query Processing in Cube Streams.

Quality%2DAware Sampling and Its Applications in Incremental Data Mining.

A QoS%2DAware and Energy%2DConserving Transcoding Proxy Using On%2DDemand Data Broadcasting.

A New Approach to Image Copy Detection Based on Extended Feature Sets.

Mining Mobile Sequential Patterns in a Mobile Commerce Environment.

Event detection in real time on a personal camera phone image collection.

Twain Two%2Dend association miner with precise frequent exhibition periods.

Constrained data clustering by depth control and progressive constraint relaxation.

On subspace clustering with density consciousness.

On progressive sequential pattern mining.

On Exploring the Power%2DLaw Relationship in the Itemset Support Distribution.

Efficient Data Broadcasting by Progressively Merging and Splitting.

Image Copy Detection via Grouping in Feature Space Based on Virtual Prior Attacks.

RESP Shortest%2DPath%2DBased Cache Replacement in a Transcoding Proxy.

User%2DAssisted Image Classification on Personal Photo Collections.

Mining Frequent Spatial Patterns in Image Databases.

COMET Event%2DDriven Clustering over Multiple Evolving Streams.

Hardware Enhanced Mining for Association Rules.

Scheduling dependent items in data broadcasting environments.

On the Necessary and Sufficient Conditions of a Meaningful Distance Function for High Dimensional Data Space.
The use of effective distance functions has been explored for many data mining problems including clustering, nearest neighbor search, and indexing. Recent research results show that if the Pearson variation of the distance distribution converges to zero with increasing dimensionality, the distance function will become unstable (or meaningless) in high dimensional space even with the commonly used Lp metric on the Euclidean space. This result has spawned many subsequent studies. We first comment that although the prior work provided the sufficient condition for the unstability of a distance function, the corresponding proof has some defects. Also, the necessary condition for unstability (i.e., the negation of the sufficient condition for the stability) of a distance function, which is required for function design, remains unknown. Consequently, we first provide in this paper a general proof for the sufficient condition of unstability. More importantly, we go further to prove that the rapid degradation of Pearson variation for a distance distribution is in fact a necessary condition of the resulting unstability. With the result, we will then have the necessary and the sufficient conditions for unstability, which in turn imply the sufficient and necessary conditions for stability. This theoretical result derived leads to a powerful means to design a meaningful distance function. Explicitly, in light of our results, we design in this paper a meaningful distance function, called Shrinkage-Divergence Proximity (abbreviated as SDP), based on a given distance function. It is empirically shown that the SDP significantly outperforms prior measures for its being stable in high dimensional data space and robust to noise, and is thus deemed more suitable for distance-based clustering applications than the priorly used metric. 1
DFEC Dynamic Forward Error Control for DVB%2DH.

Adaptive Clustering for Multiple Evolving Streams.

On the Effect of Group Mobility to Data Replication in Ad Hoc Networks.
Abstract—The growth in wireless communication technologies attracts a considerable amount of attention in mobile ad hoc networks. Since mobile hosts in an ad hoc network usually move freely, the topology of the network changes dynamically and disconnection occurs frequently. These characteristics make it likely for a mobile ad hoc network to be separated into several disconnected partitions, and the data accessibility is hence reduced. Several schemes are proposed to alleviate the reduction of data accessibility by replicating data items. However, little research effort was elaborated upon exploiting the group mobility where the group mobility refers to the phenomenon that several mobile nodes tend to move together. In this paper, we address the problem of replica allocation in a mobile ad hoc network by exploring group mobility. We first analyze the group mobility model and derive several theoretical results. In light of these results, we propose a replica allocation scheme to improve the data accessibility. Several experiments are conducted to evaluate the performance of the proposed scheme. The experimental results show that the proposed scheme is able to not only obtain higher data accessibility, but also produce lower network traffic than prior schemes. Index Terms—Mobile data service, replica allocation, data accessibility, mobile computing, ad hoc networks. 1
SOM Dynamic Push%2DPull Channel Allocation Framework for Mobile Data Broadcasting.

PeerCluster A Cluster%2DBased Peer%2Dto%2DPeer System.

Adherence clustering an efficient method for mining market%2Dbasket clusters.

GOMIT A Generic and Adaptive Annotation Algorithm Based on Gene Ontology Term Distributions.

Integrating DCT and DWT for approximating cube streams.

Frequent pattern discovery with memory constraint.

Constructing a Wrapper%2DBased DRM System for Digital Content Protection in Digital Libraries.
Abstract. Conventional digital libraries utilize access control and digital watermarking techniques to protect their digital content. These methods, however, have drawbacks. First, after passing the identity authentication process, authorized users can easily redistribute the digital assets. Second, it is impractical to expect a digital watermarking scheme to prevent all kinds of attack. Thus, how to enforce property rights after digital content has been released to authorized users is a crucial and challenging issue. In this paper, we propose a wrapper-based approach to digital content protection that integrates digital watermarking, cryptography, information protection technology, and a rights model. In this rights enforcement environment, the behavior of all content players is monitored and digital content can only be accessed after certain usage rules have been satisfied. Furthermore, the proposed architecture can be easily integrated into any digital content player, or even existing DRM systems in digital libraries. With the protection of the proposed DRM system, the abuse of digital content can be drastically reduced.
On Exploring Channel Allocation in the Diverse Data Broadcasting Environment.

Labeling Unclustered Categorical Data into Clusters Based on the Important Attribute Values.

CLUGO A Clustering Algorithm for Automated Functional Annotations Based on Gene Ontology.

Maximizing the profit for cache replacement in a transcoding proxy.


On Controlling Digital TV Set%2DTop%2DBox by Mobile Devices via IP Network.

LIPED HMM%2Dbased life profiles for adaptive event detection.


QED An Efficient Framework for Temporal Region Query Processing.

Progressive Sampling for Association Rules Based on Sampling Error Estimation.

Web log mining with adaptive support thresholds.
With the fast increase in Web activities, Web data mining has recently become an important research topic. However, most previous studies of mining path traversal patterns are based on the model of a uniform support threshold without taking into consideration such important factors as the length of a pattern, the positions of Web pages, and the importance of a particular pattern, etc. In view of this, we study and apply the Markov chain model to provide the determination of support threshold of Web documents. Furthermore, by properly employing some techniques devised for joining reference sequences, a new mining procedure of Web traversal patterns is proposed in this paper.
Combining Partitional and Hierarchical Algorithms for Robust and Efficient Data Clustering with Cohesion Self%2DMerging.

WISDOM Web Intrapage Informative Structure Mining Based on Document Object Model.

Dual Clustering Integrating Data Clustering over Optimization and Constraint Domains.

Query Processing in a Mobile Computing Environment Exploiting the Features of Asymmetry.
With the cutting edge technology advance in wireless and mobile computers, the query processing in a mobile environment involves join processing among different sites which include static servers and mobile computers. Because of the need of energy saving and also the presence of asymmetric features in a mobile computing environment, the conventional query processing for a distributed database cannot be directly applied to a mobile computing system. In this paper, we first explore three asymmetric features of a mobile environment. Then, in light of these features, we devise query processing methods for both join and query processing. Intuitively, employing semijoin operations in a mobile computing environment is able to further reduce both the amount of data transmission and energy consumption. A semijoin which is initiated by a mobile computer (respectively, the server) and is beneficial to reduce the cost of a join operation is termed a mobile-initiated, orMI (respectively, server-initiated, orSI) profitable semijoin. According to those asymmetric features of a mobile computing system, we examine three different join methods and devise some specific criteria to identify MI/SI profitable semijoins. For query processing which refers to the processing of multi-join queries, we
Design and Performance Studies of an Adaptive Cache Retrieval Scheme in a Mobile Computing Environment.
In a mobile computing system, as users move to a new service area, the new server is usually considered to take over the execution of running programs for mobile users from the previous server so as to reduce the communication overhead of a mobile system. This procedure is referred to as service handoff. Note that when service handoff occurs, the new server will lose its advantage for cache access. To remedy this, we explore in this paper several cache retrieval schemes to improve the efficiency of cache retrieval. In particular, we analyze the impact of using a coordinator buffer to improve the overall performance of cache retrieval. Moreover, in light of the properties of transactions (i.e, temporal locality of data access among transactions), we devise a Dynamic and Adaptive cache Retrieval scheme (DAR) that can utilize proper cache methods according to some specific criteria to deal with the service handoff situation in a mobile computing environment. Performance of these cache retrieval schemes is analyzed and a system simulator is developed to validate our results. We devise a systematic procedure for determining the optimal operating points of DAR. Our experimental results show that by adaptively adopting the advantages of different cache retrieval methods, DAR significantly outperforms other schemes and is particularly effective for a mobile computing environment. Index Terms –Mobile computing, service handoff, mobile database, cache retrieval scheme, temporal locality. 1
Shared Data Allocation in a Mobile Computing System Exploring Local and Global Optimization.

Integrating Web Caching and Web Prefetching in Client%2DSide Proxies.

Sliding window filtering an efficient method for incremental mining on a time%2Dvariant database.

A statistical framework for mining substitution rules.

Clustering on Demand for Multiple Data Streams.

DDS an efficient dynamic dimension selection algorithm for nearest neighbor search in high dimensions.

A QoS%2DAware Transcoding Proxy Using On%2Ddemand Data Broadcasting.
The high diversity in the capabilities of various mobile de-vices such as display capabilities and computation power makes the design of mobile information systems more challenging. A transcoding proxy is placed between a client and an information server to coordinate the mismatch be-tween what the server provides and what the client prefers. However, most research works in transcoding proxies in mo-bile computing environments are under the traditional client-server architecture and do not employ the data broadcast technique which is has been deemed a promising technique to design a power conservation, high scalable and high band-width utilization. In addition, the issue of QoS provision is also not addressed. In view of this, we design in this paper a QoS-aware transcoding proxy by utilizing the on-demand broadcasting technique. We first propose a QoS-aware transcoding proxy architecture, abbreviated as QTP, and model it as a queueing network. By analyzing the queueing network, several theoretical results are derived. We then propose a version decision policy and a service admission control scheme to provide QoS in QTP. The derived results are used to guide the execution of the proposed version decision policy and service admission control scheme to achieve the given QoS requirement. To measure the performance of QTP, several experiments are conducted. Experimental results show that the proposed scheme is more scalable than traditional client-server systems. In addition, the proposed scheme is able to effectively control the system load to attain the desired QoS.
Subspace Clustering of High Dimensional Spatial Data with Noises.

Clustering Categorical Data Using the Correlated%2DForce Ensemble.

DOMISA DOM%2DBased Information Space Adsorption of Web Information Hierarchy Mining.

Resource%2DAware Mining with Variable Granularities in Data Streams.
For data stream applications, both approximation and adaptability are important issues for effective mining. We explore in this paper a fundamental problem that how the limited resources, e.g., memory space and computation power, can be well utilized to produce accurate estimates. Two important features for tracking mined patterns with properly utilized resources are examined. The first issue is temporal granularity which refers to the phenomenon that as time advances, people are more interested in recent events, meaning that more resources can be utilized to explore more recent data with finer granularities. Second, with the mining task of discovering frequent temporal patterns, more resources are expected to be allocated to the processing of those borderline patterns whose statistics, e.g., occurrence frequencies, are close to the specified thresholdsoastohaveproperfrequentitemsetidentification. This feature is called mining with support count granularity. Consequently, algorithm RAM-DS (Resource-Aware Mining for Data Streams) is designed to not only reduce the memory required for data storage but also retain good approximation of target time series. Experimental results have shown that the memory required for storing significant wavelet coefficients is very small and the quality of approximation is stable when performing incremental data updates, indicating that algorithm RAM-DS is feasible and suitable for adaptive mining in data streams. 1
Multimedia Over IP for Thin Clients Building a Collaborative Resource%2DSharing Prototype.

Mining Web Informative Structures and Contents Based on Entropy Analysis.
Abstract—In this paper, we study the problem of mining the informative structure of a news Web site that consists of thousands of hyperlinked documents. We define the informative structure of a news Web site as a set of index pages (or referred to as TOC, i.e.,
Dependent Data Broadcasting for Unordered Queries in a Multiple Channel Mobile Environment.

An H.323 gatekeeper prototype design%2C implementation%2C and performance analysis.

Mobile Data Management

Exploring group mobility for replica data allocation in a mobile environment.
The growth in wireless communication technologies attracts a considerable amount of attention in mobile ad-hoc networks. Since mobile hosts in an ad-hoc network usually move freely, the topology of the network changes dynamically and disconnection occurs frequently. These characteristics make a mobile ad-hoc network be likely to be separated into several disconnected partitions, and the data accessibility is hence reduced. Several schemes are proposed to alleviate the reduction of data accessibility by replicating data items. However, little research effort was elaborated upon exploiting the group mobility where the group mobility refers to the phenomenon that several mobile nodes tend to move together. In this paper, we address the problem of replica allocation in a mobile ad-hoc network by exploring group mobility. We first analyze the group mobility model and derive several theoretical results. In light of these results, we propose a replica allocation scheme to improve the data accessibility. Several experiments are conducted to evaluate the performance of the proposed scheme. The experimental results show that the proposed scheme is able to not only obtain higher data accessibility but also produce lower network traffic than prior schemes.
Inference Based Classifier Efficient Construction of Decision Trees for Sparse Categorical Attributes.

Broadcasting Dependent Data for Ordered Queries without Replication in a Multi%2DChannel Mobile Environment.

Clustering Item Data Sets with Association%2DTaxonomy Similarity.

Progressive Weighted Miner An Efficient Method for Time%2DConstraint Mining.

Broadcast Program Generation for Unordered Queries with Data Replication.
We study in this paper the problem of broadcasting dependent data for unordered queries. However, most prior studies on dependent data broadcasting are limited to the premise of no data replication. Different from other prior studies, we investigate the effect of data replication in this paper. Specifically, we first derive several theoretical properties for the average access time by analyzing the model of dependent data broadcasting. On the basis of the theoretical results, we develop a genetic algorithm to generate broadcast programs with replication. In order to compare the performance of the proposed algorithm and the prior studies, several experiments are conducted. Our experimental results show that with the analytical results derived, the theoretical results derived are able to guide the search of the genetic algorithm very effectively, and lead to solution broadcast programs of higher quality than those of the prior studies.
On the Techniques for Data Clustering with Numerical Constraints.
In this paper, the attributes employed to model the constraints are called constraint attributes and those attributes involved in the objective function to be optimized are called cost-optimal attributes. The constrained clustering considered is conducted in such a way that the objective function of cost-optimal attributes is optimized subject to the condition that the imposed constraint is satisfied. Explicitly, we address the problem of constrained clustering with numerical constraints, in which the constraint attribute values of any two data items in the same cluster are required to be within the corresponding constraint range. We devise an effective and efficient algorithm with complete-link to solve this clustering problem. It is noted that due to the intrinsic nature of the numerical constrained clustering, there is an order dependency on the process of attaining the clustering, which in many cases degrades the clustering results. In view of this, we devise a progressive constraint relaxation technique to remedy this drawback and improve the overall performance of clustering results. Explicitly, by using a smaller (tighter) constraint range in earlier iterations of merge, we will have more room to relax the constraint and seek for better solutions in subsequent iterations. It is empirically shown that the progressive constraint relaxation technique is able to improve not only the execution efficiency but also the clustering quality.
VIPAS Virtual Link Powered Authority Search in the Web.
With the exponential growth of the World Wide Web, looking for pages with high quality and relevance in the Web has become an important research field. There have been many keywordbased search engines built for this purpose. However, these search engines usually suffer from the problem that a relevant Web page may not contain the keyword in its page text. Algorithms exploiting the link structure of Web documents, such as HITS, have also been proposed to overcome the problems of traditional search engines. Though these algorithms perform better than keywordbased search engines, they still have some defects. Among others, one major problem is that links in Web pages are only able to reflect the view of the page authors on the topic of those pages but not that of the page readers. In this paper, we propose a new algorithm with the idea of using virtual links which are created according to what the user behaves in browsing the output list of the query result. These virtual links are then employed to identify authoritative resources in the Web. Specifically, the algorithm, referred to as algorithm VIPAS (standing for virtual link powered authority search), is divided into three phases. The first phase performs basic link analysis. The second phase collects statistics by observing the user behavior in browsing pages listed in the query result, and virtual links are then created according to what observed. In the third phase, these virtual links as well as real ones are taken together to produce an updated list of authoritative pages that will be presented to the user when the query
A Regression%2DBased Temporal Pattern Mining Scheme for Data Streams.
We devise in this paper a regression-based algorithm, called algorithm FTP-DS (Frequent Temporal Patterns of Data Streams), to mine frequent temporal patterns for data streams. While providing a general framework of pattern frequency counting, algorithm FTP-DS has two major features, namely one data scan for online statistics collection and regressionbased compact pattern representation. To attain the feature of one data scan, the data segmentation and the pattern growth scenarios are explored for the frequency counting purpose. Algorithm FTP-DS scans online transaction flows and generates candidate frequent patterns in real time. The second important feature of algorithm FTP-DS is on the regression-based compact pattern representation. Specifically, to meet the space constraint, we devise for pattern representation a compact ATF (standing for Accumulated Time and Frequency) form to aggregately comprise all the information required for regression analysis. In addition, we develop the techniques of the segmentation tuning and segment relaxation to enhance the functions of FTP-DS. With these features, algorithm FTP-DS is able to not only conduct mining with variable time intervals but also perform trend detection effectively. Synthetic data and a real dataset which contains net-
Clustering for Web Information Hierarchy Mining.

Optimizing Index Allocation for Sequential Data Broadcasting in Wireless Mobile Computing.

Developing Data Allocation Schemes by Incremental Mining of User Moving Patterns in a Mobile Computing System.
Abstract—In this paper, we present a new data mining algorithm which involves incremental mining for user moving patterns in a mobile computing environment and exploit the mining results to develop data allocation schemes so as to improve the overall performance of a mobile system. First, we propose an algorithm to capture the frequent user moving patterns from a set of log data in a mobile environment. The algorithm proposed is enhanced with the incremental mining capability and is able to discover new moving patterns efficiently without compromising the quality of results obtained. Then, in light of mining results of user moving patterns and the properties of data objects, we develop data allocation schemes that can utilize the knowledge of user moving patterns for proper allocation of both personal and shared data. By employing the data allocation schemes, the occurrences of costly remote accesses can be minimized and the performance of a mobile computing system is thus improved. For personal data allocation, two data allocation schemes, which explore different levels of mining results, are devised: one utilizes the set level of moving patterns and the other utilizes the path level of moving patterns. As can be seen later, the former is useful for the allocation of read-intensive data objects, whereas the latter is good for the allocation of update-intensive data objects. The data allocation schemes for shared data, which are able to achieve local optimization and global optimization, are also developed. Performance of these data allocation schemes is comparatively analyzed. It is shown by our simulation results that the knowledge obtained from the user moving patterns is very important in devising effective data allocation schemes which can lead to significant performance improvement in a mobile computing system. Index Terms—Data mining, mobile computing, user moving patterns, data allocation scheme, mobile database. 1
Progressive Partition Miner An Efficient Algorithm for Mining General Temporal Association Rules.

Adaptive Information Dissemination An Extended Wireless Data Broadcasting Scheme with Loan%2DBased Feedback Control.
Abstract—The dissemination of numerous information broadcast services gives rise to the scalability issue in wireless networks. Previous researchers have shown that the push-based data broadcast mechanism is efficient in reducing message traffic. However, most research efforts are dedicated to the dissemination of static information contents. In practice, information broadcast services can produce and deliver dynamic information contents. To efficiently convey the dynamic data, we devise, in this paper, an adaptive information dissemination mechanism by exploiting the functionality of data broadcasting, to support the dissemination of static and dynamic information services simultaneously. In our design, both static and dynamic information services are subsumed as service groups, i.e., the building blocks with the uniform representation of structure and group popularity and, thus, the conventional scenario becomes a special case of our framework. Furthermore, in order to tolerate the broadcast traffic dynamics, we design an online loanbased slot allocation and feedback control technique to deal with the adaptation of the service group classification, bandwidth allocation, and broadcast schedule so as to avoid performance degradation. It is shown by the experimental study that the proposed adaptive information dissemination mechanism associated with the online loan-based feedback control is able to achieve a substantial reduction of message traffic for dynamic information dissemination in wireless networks. Index Terms—Push, adaptation, feedback control, data broadcast, information dissemination, wireless network. 1
On Exploring Aggregate Effect for Efficient Cache Replacement in Transcoding Proxies.

Dynamic Leveling Adaptive Data Broadcasting in a Mobile Computing Environment.
The research issue of broadcasting has attracted a considerable amount of attention in a mobile computing system. By utilizing broadcast channels, a server is able to continuously and repeatedly broadcast data to mobile users. From these broadcast channels, mobile users obtain the data of interest efficiently and only need to wait for the required data to be present on the broadcast channel. Given the access frequencies of data items, one can design proper data allocation in the broadcast channels to reduce the average expected delay of data items. In practice, the data access frequencies may vary with time. We explore in this paper the problem of adjusting broadcast programs to effectively respond to the changes of data access frequencies, and develop an efficient algorithm DL to address this problem. Performance of algorithm DL is analyzed and a system simulator is developed to validate our results. Sensitivity analysis on several parameters, including the number of data items, the number of broadcast disks, and the variation of access frequencies, is conducted. It is shown by our results that the broadcast programs adjusted by algorithm DL are of very high quality and are in fact very close to the optimal ones.
Efficient Channel Allocation Tree Generation for Data Broadcasting in a Mobile Computing Environment.

Entropy%2Dbased link analysis for mining web informative structures.
In this paper, we study the problem of mining the informative structure of a news Web site which consists of thousands of hyperlinked documents. We define the informative structure of a news Web site as a set of index pages (or referred to as TOC, i.e., table of contents, pages) and a set of article pages linked by TOC pages through informative links. It is noted that the Hyperlink Induced Topics Search (HITS) algorithm has been employed to provide a solution to analyzing authorities and hubs of pages. However, most of the content sites tend to contain some extra hyperlinks, such as navigation panels, advertisements and banners, so as to increase the add-on values of their Web pages. Therefore, due to the structure induced by these extra hyperlinks, HITS is found to be insufficient to provide a good precision in solving the problem. To remedy this, we develop an algorithm to utilize entropy-based link analysis to mine Web informative structures. This algorithm is referred to as LAMIS, standing for entropy-based Link Analysis on Mining web Informative Structures. The key idea of LAMIS is to utilize information entropy for representing the knowledge that corresponds to the amount of information in a link or a page in the link analysis. Experiments on several real news Web sites show that the precision and recall of LAMIS is much superior to those obtained by heuristic methods and also that the link analysis techniques derived are very powerful to mining the informative structures of news Web sites. In average, the augmented LAMIS leads to prominent performance improvement and increases the precision by a factor ranging from 133 % to 232 % when the desired recall falls between 0.5 and 1.
A new cache replacement algorithm for the integration of web caching and prefectching.

Design and Implementation of a Network Application Architecture for Thin Clients.

SIFA A Scalable File System with Intelligent File Allocation.

Self%2DTuning Clustering An Adaptive Clustering Method for Transaction Data.

Dynamic Data Broadcasting with Traffic Awareness.
Data dissemination has significantly served as a scalable data delivery mechanism in wireless networks. However, even though the broadcast traffic has the nature of dynamic changes, most previous research efforts were elaborated upon the premise of static workloads and access patterns without having proper traffic awareness. In this paper, we address the existence of client impatience and accordingly devise an on-line traffic awareness mechanism based on a novel selective deferment and reflection technique (SDR) to estimate the dynamic workloads and access patterns in a granularity of a broadcast cycle. In comparison with prior probing and feedback approaches, our design is of practical usefulness in that it has low complexity and is light-weight without performance degradation. With various dynamic traffic scenarios, the experimental results show that with an increasing/decreasing workload, the real access frequency distribution is bounded by two specific estimated distributions. This fact in turn suggests us to employ a trigonometric tuning method to further enhance the estimation. In addition, we examine that the mean difference between the estimated access frequency distribution and the real one is very small, consequently indicating the feasibility and reliability of our proposed data broadcast mechanism with traffic awareness.
Exploring Aggregate Effect with Weighted Transcoding Graphs for Efficient Cache Replacement in Transcoding Proxies.

On the Mining of Substitution Rules for Statistically Dependent Items.

Using Category%2DBased Adherence to Cluster Market%2DBasket Data.

Mining General Temporal Association Rules for Items with Different Exhibition Periods.

Distributed data mining in a chain store database of short transactions.
In this paper, we broaden the horizon of traditional rule mining by introducing a new framework of causality rule mining in a distributed chain store database. Specifically, the causality rule explored in this paper consists of a sequence of triggering events and a set of consequential events, and is designed with the capability of mining non-sequential, intertransaction information. Hence, the causality rule mining provides a very general framework for rule derivation. Note, however, that the procedure of causality rule mining is very costly particularly in the presence of a huge number of candidate sets and a distributed database, and in our opinion, cannot be dealt with by direct extensions from existing rule mining methods. Consequently, we devise in this paper a series of level matching algorithms, including Level Matching (abbreviateally as LM), Level Matching with Selective Scan (abbreviatedly as LMS), and Distributed Level Matching (abbreviatedly as Distibuted LM), to minimize the computing cost needed for the distributed data mining of causality rules. In addition, the phenomena of time window constraints are also taken into consideration for the development of our algorithms. As a result of properly employing the technologies of level matching and selective scan, the proposed algorithms present good efficiency and scalability in the mining of local and global causality rules. Scale-up experiments show that the proposed algorithms scale well actions.
A robust and efficient clustering algorithm based on cohesion self%2Dmerging.
Data clustering has attracted a lot of research attention in the field of computational statistics and data mining. In most related studies, the dissimilarity between two clusters is defined as the distance between their centroids, or the dis- tance between two closest (or farthest) data points. How- ever, all of these measurements are vulnerable to outliers, and removing the outliers precisely is yet another difficult task. In view of this, we propose a new similarity measurement, referred to as cohesion, to measure the inter-cluster distances. By using this new measurement of cohesion, we design a two-phase clustering algorithm, called cohesion- based self-merging (abbreviated as CSM), which runs in lin- ear time to the size of input data set. Combining the features of partitional and hierarchical clustering methods, algorithm CSM partitions the input data set into several small subclusters in the first phase, and then continuously merges the sub- clusters based on cohesion in a hierarchical manner in the second phase. As shown by our performance studies, the cohesion-based clustering is very robust and possesses the excellent tolerance to outliers in various workloads. More importantly, algorithm CSM is shown to be able to cluster the data sets of arbitrary shapes very efficiently, and provide better clustering results than those by prior methods.
Allocation of Shared Data Based on Mobile User Movement.

Mining Relationship between Triggering and Consequential Events in a Short Transaction Database.

On the Optimal Clustering of Sequential Data.

Processing Distributed Mobile Queries with Interleaved Remote Mobile Joins.

On the Asymptotical Optimality of Multilayered Decentralized Consensus Protocol.%2
D ghqfhqwudol}hg frqvhqvxv surwrfro uhihuv wr d sur0 fhvv iru doo qrghv lq d glvwulexwhg v|vwhp wr froohfw wkh lqirupdwlrq2vwdwxv iurp hyhu| rwkhu qrgh dqg uhdfk d frqvhqvxv dprqj wkhp1 Wzr fodvvhv ri ghfhqwudo0 l}hg frqvhqvxv surwrfrov kdyh ehhq vwxglhg ehiruh= wkh rqh zlwkrxw dq lqlwldwru dqg wkh rqh zlwk dq lql0 wldwru1 Zkloh wkh rqh zlwkrxw dq lqlwldwru kdv ehhq zhoo vwxglhg lq wkh olwhudwxuh/ lw lv qrwhg wkdw wkh sulru surwrfrov zlwk dq lqlwldwru pdlqo| uholhg xsrq wkh rqh zlwkrxw dq lqlwldwru dqg wkxv glg qrw ixoo| h{sorlw wkh lqwulqvlf surshuwlhv ri kdylqj dq lqlwldwru1 E| h{sorlw0 lqj wkh frqfhsw ri pxowl0od|huhg h{hfxwlrq/ zh ghyhors lq wklv sdshu dq h#flhqw pxowl0od|huhg ghfhqwudol}hg frqvhqvxv surwrfro iru d glvwulexwhg v|vwhp zlwk dq lqlwldwru1 E| dgdswlqj lwvhoi wr wkh qxpehu ri qrghv lq wkh v|vwhp/ wkh sursrvhg surwrfro fdq ghwhuplqh d surshu od|hu iru h{hfxwlrq dqg uhdfk wkh frqvhqvxv lq wkh plqlpdo qxpehuv ri phvvdjh vwhsv zkloh lqfxuulqj d pxfk vpdoohu qxpehu ri phvvdj...
On the Asymptotical Optimality of Multilayered Decentralized Consensus Protocol.%2
D ghqfhqwudol}hg frqvhqvxv surwrfro uhihuv wr d sur0 fhvv iru doo qrghv lq d glvwulexwhg v|vwhp wr froohfw wkh lqirupdwlrq2vwdwxv iurp hyhu| rwkhu qrgh dqg uhdfk d frqvhqvxv dprqj wkhp1 Wzr fodvvhv ri ghfhqwudo0 l}hg frqvhqvxv surwrfrov kdyh ehhq vwxglhg ehiruh= wkh rqh zlwkrxw dq lqlwldwru dqg wkh rqh zlwk dq lql0 wldwru1 Zkloh wkh rqh zlwkrxw dq lqlwldwru kdv ehhq zhoo vwxglhg lq wkh olwhudwxuh/ lw lv qrwhg wkdw wkh sulru surwrfrov zlwk dq lqlwldwru pdlqo| uholhg xsrq wkh rqh zlwkrxw dq lqlwldwru dqg wkxv glg qrw ixoo| h{sorlw wkh lqwulqvlf surshuwlhv ri kdylqj dq lqlwldwru1 E| h{sorlw0 lqj wkh frqfhsw ri pxowl0od|huhg h{hfxwlrq/ zh ghyhors lq wklv sdshu dq h#flhqw pxowl0od|huhg ghfhqwudol}hg frqvhqvxv surwrfro iru d glvwulexwhg v|vwhp zlwk dq lqlwldwru1 E| dgdswlqj lwvhoi wr wkh qxpehu ri qrghv lq wkh v|vwhp/ wkh sursrvhg surwrfro fdq ghwhuplqh d surshu od|hu iru h{hfxwlrq dqg uhdfk wkh frqvhqvxv lq wkh plqlpdo qxpehuv ri phvvdjh vwhsv zkloh lqfxuulqj d pxfk vpdoohu qxpehu ri phvvdj...
Sliding%2DWindow Filtering An Efficient Algorithm for Incremental Mining.
We explore in this paper an e#ective sliding-window filtering (abbreviatedly as SWF) algorithm for incremental mining of association rules. In essence, by partitioning a transaction database into several partitions, algorithm SWF employs a filtering threshold in each partition to deal with the candidate itemset generation. Under SWF, the cumulative information of mining previous partitions is selectively carried over toward the generation of candidate itemsets for the subsequent partitions. Algorithm SWF not only significantly reduces I/O and CPU cost by the concepts of cumulative fil- tering and scan reduction techniques but also e#ectively controls memory utilization by the technique of sliding-window partition. Algorithm SWF is particularly powerful for e#- cient incremental mining for an ongoing time-variant transaction database. By utilizing proper scan reduction techniques, only one scan of the incremented dataset is needed by algorithm SWF. The I/O cost of SWF is, in orders of magnitude, smaller than those required by prior methods, thus resolving the performance bottleneck. Experimental studies are performed to evaluate performance of algorithm SWF. It is noted that the improvement achieved by algorithm SWF is even more prominent as the incremented portion of the dataset increases and also as the size of the database increases.
Binary Interpolation Search for Solution Mapping on Broadcast and On%2Ddemand Channels in a Mobile Computing Environment.
We explore in this paper the problem of dynamic data and channel allocations with the number of communication channels and the number of data items given. It is noted that the combined use of broadcast and on-demand channels can utilize the bandwidth effectively for data dissemination in a mobile computing environment. We first derive the analytical models of the expected delays when the data are requested through the broadcast and on-demand channels. Then, we transform this problem into to a guided search problem. In light of the theoretical properties derived, we devise an algorithm based on binary interpolation search, referred to as algorithm BIS, to obtain solutions of high quality efficiently. In essence, algorithm BIS is guided to explore the solution space with higher likelihood to be the optimal first, thereby leading to an efficient and effective search. It is shown by our simulation results that the solution obtained by algorithm BIS is of very high quality and is in fact very close to the optimal one. Sensitivity analysis on several parameters, including the number of data items and the number of communication channels, is conducted. Keywords Data dissemination, dynamic data and channel allocation, mobile computing, data broadcasting 1.
An Efficient Clustering Algorithm for Market Basket Data Based on Small Large Ratios.

Mining Sequential Alarm Patterns in a Telecommunication Database.
A telecommunication system produces daily a large amount of alarm  data which contains hidden valuable information about the system behavior.
Load Balancing Studies on an H.323 Gatekeeper Prototype.

Distributed Query Processing in the Internet Exploring Relation Replication and Network Characteristics.
We introduce the concept of network graph for distributed query processing. Semijoins and joins are termed contributive replicated semijoins and contributive replicated joins, respectively, when they are interleaved into a join sequence to reduce the amount of data transmission cost required in a network with replicated relations. Our solution procedure consists of three consecutive steps, namely relation selection, join sequence scheduling and merge processing. A simulator is developed to evaluate the performance of algorithms devised. Our results show that the approach of interleaving a join sequence with contributive replicated semijoins/joins is not only efficient in its execution but also effective in reducing the total amount of data transmission cost required to process distributed queries. 1.
On Mining General Temporal Association Rules in a Publication Database.
In this paper, we explore a new problem of mining general temporal association rules in publication databases. In essence, a publication database is a set of transactions where each transaction T is a set of items of which each item contains an individual exhibition period. The current model of association rule mining is not able to handle the publication database due to the following fundamental problems, i.e., (1) lack of consideration of the exhibition period of each individual item; (2) lack of an equitable support counting basis for each item. To remedy this, we propose an innovative algorithm Progressive-Partition-Miner (abbreviatedly as PPM) to discover general temporal association rules in a publication database. The basic idea of PPM is to first partition the publication database in light of exhibition periods of items and then progressively accumulate the occurrence count of each candidate 2-itemset based on the intrinsic partitioning characteristics. Algorithm PPM is also designed to employ a filtering threshold in each partition to early prune out those cumulatively infrequent  2-itemsets. Explicitly, the execution time of PPM is, in orders of magnitude, smaller than those required by the schemes which are directly extended from existing methods. 1 
Wavelet based active contour model for object tracking.

An Adaptive Transmission Scheme for Audio and Video Synchronization based on Real%2Dtime Transport Protocol.

Design And Implementation Of An H.323 Gatekeeper Prototype.


Error%2DResilient Real%2DTime Video Communications over IP%2DBased lans.
Video communication over IP networks involves more issues than that over ATM networks in terms of error control. First, IP networks provide neither prioritized transmission nor guaranteed QOS for data packets. Second, video streams need to be packetized well before transmission over IP networks in order to have good error resilience characteristics. Finally, the mitigation of spatial and temporal error propagation in IP networks is very different from that in ATM networks upon the loss of IP packets. In this paper, we develop an error-resilient video communication system based on the H.323 family of ITU-T recommendations. With a low-delay backward channel for packet receipt reports, bidirectional error resilience mechanisms are employed to avoid error spreading in the temporal domain. Two operation modes, i.e., ACK and NACK, are devised for two communicating parties to eliminate error propagation after either one frame lag or one round trip delay without consuming much additional bandwidth as compared to simple INTRA updates. Our system can also adaptively choose an operation mode to maintain a satisfactory video quality at the decoder under variable channel error conditions. It is shown by experimental results that our error control scheme is suitable for video transmission over IP-based LANs at packet loss rates up to 20%.
Multimedia Over IP For Thin Clients  Building A Collaborative Resource%2DSharing Prototype.

Adaptive Recovery Techniques for Real%2DTime Audio Streams.
There are a number of packet-loss recovery techniques proposed for streaming audio applications recently. However, there are few works that are able to exploit the tradeoff between the recovery quality and the computational complexity. In this paper, we develop a recovery method, called DSPWR (Double Sided Pitch Waveform Replication) which is able to tolerate a much higher packet loss rate. In essence, DSPWR is composed of several procedures devised to improve the quality of the reconstructed speech. It is noted that a more sophisticated recovery scheme that can tolerate a higher degree of packet loss in general requires a larger computational cost. In view of this, we evaluate the quality of the reconstructed speech under different packet loss rates for various receiver-based recovery methods, and compare the computational complexity among these methods. Under the acceptable speech quality whose MOS (Mean Opinion Score) is above 3.5, we develop an adaptive mechanism that can select the recovery method with the minimal complexity in accordance with different packet loss rates encountered. To conduct real experiments in the networks, we implement these recovery methods and evaluate the performance of DSPWR devised and the adaptive recovery techniques empirically. As validated by our experimental results, the adaptive mechanism is able to strike a compromise between the computational overhead and the quality of the speech desired.  I. 
Experimental Results on a Constrained Based Sequential Pattern Mining for Telecommunication Alarm Data.

Dynamic Generation of Data Broadcasting Programs for a Broadcast Disk Array.
We explore in this paper the problem of generating hierarchical broadcast programs with the data access frequencies and the number of broadcast disks in a broadcast disk array given. Specifically, we first transform the problem of generating hierarchical broadcast programs into the one of constructing a channel allocation tree with variant-fanout. By exploiting the feature of tree generation with variantfanout, we develop a heuristic algorithm VF K to minimize the expected delay of data items in the broadcast program. Performance of these algorithms is analyzed. It is shown by our simulation results that by exploiting the feature of variant-fanout in constructing the channel allocation tree, the solution obtained by algorithm VF K is of very high quality and is in fact very close to the optimal one.
Using Pattern%2DJoin and Purchase%2DCombination for Mining Web Transaction Patterns in an Electronic Commerce Environment.
In this paper, we explore the data mining capability which involves mining Web transaction patterns for an electronic commerce (EC) environment. To better reflect the customer usage patterns in the EC environment, we propose a mining model that takes both the traveling patterns and purchasing behavior of customers into consideration. We devise two efficient algorithms (MTSPJ,andMTSPC) for determining the frequent transaction patterns, which are termed large transaction patterns in this paper. In addition, algorithm WTM devised in our prior work, is used for comparison purposes. By utilizing the path-trimming technique which is developed to exploit the relationship between traveling and purchasing behaviors, MTSPJ and MTSPC are able to generate the large transaction patterns very efficiently. A simulation model for the EC environment is developed and a synthetic workload is generated for performance studies. 1
Exploiting the Features of Asymmetry for Query Processing in a Mobile Computing Environment.
Abstract. With the cutting edge technology advance in wireless and mobile computers, the query processing in a mobile environment involves join processing among different sites which include static servers and mobile computers. Because of the need of energy saving and also the presence of asymmetric features in a mobile computing environment, the conventional query processing for a distributed database cannot be directly applied to a mobile computing system. In this paper, we first explore three asymmetric features of a mobile environment. Then, in light of these features, we devise query processing schemes. Performance of these query processing schemes is comparatively analyzed and sensitivity analysis on several parameters is conducted. 1
An Asymptotically Optimal Multi%2DLayered Decentralized Consensus Protocol with an Initiator.
D ghqfhqwudol}hg frqvhqvxv surwrfro uhihuv wr d sur0 fhvv iru doo qrghv lq d glvwulexwhg v|vwhp wr froohfw wkh lqirupdwlrq2vwdwxv iurp hyhu| rwkhu qrgh dqg uhdfk d frqvhqvxv dprqj wkhp1 Wzr fodvvhv ri ghfhqwudo0 l}hg frqvhqvxv surwrfrov kdyh ehhq vwxglhg ehiruh= wkh rqh zlwkrxw dq lqlwldwru dqg wkh rqh zlwk dq lql0 wldwru1 Zkloh wkh rqh zlwkrxw dq lqlwldwru kdv ehhq zhoo vwxglhg lq wkh olwhudwxuh/ lw lv qrwhg wkdw wkh sulru surwrfrov zlwk dq lqlwldwru pdlqo| uholhg xsrq wkh rqh zlwkrxw dq lqlwldwru dqg wkxv glg qrw ixoo| h{sorlw wkh lqwulqvlf surshuwlhv ri kdylqj dq lqlwldwru1 E| h{sorlw0 lqj wkh frqfhsw ri pxowl0od|huhg h{hfxwlrq/ zh ghyhors lq wklv sdshu dq h#flhqw pxowl0od|huhg ghfhqwudol}hg frqvhqvxv surwrfro iru d glvwulexwhg v|vwhp zlwk dq lqlwldwru1 E| dgdswlqj lwvhoi wr wkh qxpehu ri qrghv lq wkh v|vwhp/ wkh sursrvhg surwrfro fdq ghwhuplqh d surshu od|hu iru h{hfxwlrq dqg uhdfk wkh frqvhqvxv lq wkh plqlpdo qxpehuv ri phvvdjh vwhsv zkloh lqfxuulqj d pxfk vpdoohu qxpehu ri phvvdj...
A Multi%2DChannel Channel%2DOptimized Scheme for EZW Using Rate%2DDistortion Functions.
We develop a multi-channel channel-optimized scheme for EZW image compression in a noisy transmission environment. A block-based modification for EZW is applied to improve the robustness of EZW, and to produce several coded bitstreams for transmission over multiple channels with different noise conditions. Then the respective channel noise is considered in the ratedistortion analysis, and the resultant rate-distortion functions are used for optimal bit allocation among the coded bitstreams. The case of burst noise is analyzed as an example.  1. INTRODUCTION  The modern communication system mainly consists of the source coding and the channel coding. These two parts are usually designed separately because of Shannon &#039;s separation principle [1]. The separated design of source coding from channel coding can be potentially inefficient in practice. For example, the Embedded Zerotree Wavelet (EZW) coder [2] is known to be the state-of-art image compression algorithm, but even a single bit er...
Mining User Moving Patterns for Personal Data Allocation in a Mobile Computing System.


On Building an Internet Gateway for Internet Telephony.

Mining Web Transaction Patterns in an Electronic Commerce Environment.
In this paper, we explore a new data mining capability which involves mining Web transaction patterns for an electronic commerce (EC) environment. We propose an innovative mining model that takes both the traveling patterns and purchasing patterns of customers into consideration. First, we develop algorithm WR to extract meaningful Web transaction records from Web transactions so as to filter out the e#ect of irrelevant traversal sequences. Second, we devise algorithm WTM for determining the large transaction patterns from the Web transaction records obtained. 1 Introduction  Some existing electronic commerce environments [1][2], Web pages are usually designed as shop-windows. Customers can visit these Web pages and make Web transactions through the Web interface. It is known that mining information from such an EC system can provide very valuable information on consumer buying behavior and the quality of business strategies can then be improved [4]. Consequently, we shall explore in t...
Estimation of 2%2DD noisy fractional Brownian motion and its applications using wavelets.
The 2-D fractional Brownian motion (fBm) model is useful in describing natural scenes and textures. Most fractal estimation algorithms for 2-D isotropic fBm images are simple extensions of the 1-D fBm estimation method. This method does not perform well when the image size is small (say, 32 \Theta 32). We propose a new algorithm that estimates the fractal parameter from the decay of the variance of the wavelet coefficients across scales. Our method places no restriction on the wavelets. Also, it provides a robust parameter estimation for small noisy fractal images. For image denoising, a Wiener filter is constructed by our algorithm using the estimated parameters and is then applied to the noisy wavelet coefficients at each scale. We show that the averaged power spectrum of the denoised image is isotropic and is a near  1  f process. The performance of our algorithm is shown by numerical simulation for both the fractal parameter and the image estimation. Applications on coastline detec...
Robust Block%2DBased EZW Image Compression with Channel Noise Optimized Rate%2DDistortion Functions.
We apply the dynamic bit allocation to the block-based EZW algorithm for robust image compression. To optimize the performance of the bit allocation, the effect of the channel noise is concerned. The robustness of our method was evaluated.  1. INTRODUCTION  Image compression is both an important research topic and a useful application in the image processing society. The increasing demand for transmission of image data over noisy channels makes the robustness of image compression algorithms more important than just the PSNR performance constraints. In this paper, we analyze the rate-distortion functions over block-based EZW bitstream in a noisy channel environment. Our innovation lies in considering the statistics of the channel noise in rate-distortion analysis.  Recently, the best image compression method is known as Embedded Zerotree Wavelet (EZW) algorithm [1]. Although several improved methods of EZW [2] are proposed, their basic ideas are similar. Therefore, we concentrate on the...
Capturing User Access Patterns in the Web for Data Mining.

Using Multi%2DAttribute Predicates for Mining Classification Rules.

A Dynamic and Adaptive Cache Retrieval Scheme for Mobile Computing.
Recent advances in wireless technologies have made the mobile computing a reality. In order to provide services of good quality to mobile users and improve the system performance, the mobile computing system is usually of a distributed server architecture. As users move to a new service area, the new server is expected to take over the execution of running programs for mobile users so as to reduce the communication overhead of the mobile system. This procedure is referred to as service handoff. Note that when service handoff occurs, the cache of the new server does not contain any data entry that was accessed by prior transactions and the new server will thus lose its advantages for cache access. To remedy this, we examine in this paper several cache retrieval schemes to improve the efficiency of cache retrieval. In particular, we analyze the impact of using a coordinator buffer to improve the overall performance of cache retrieval. Moreover, in light of the properties of transactions (i.e, temporal locality of data access among transactions), we devise a Dynamic and Adaptive cache Retrieval scheme (DAR) that can adopt proper cache methods based on some specific criteria devised to deal with the service handoff situation in a mobile computing environment. The performance of these cache retrieval schemes is analyzed and a system simulator is developed to validate our results. 1.
Energy%2DEfficient Mobile Cache Invalidation.
Caching data in a wireless mobile computer can significantly reduce the bandwidth requirement. However, due to battery power limitation, a wireless mobile computer may often be forced to operate in a doze or even totally disconnected mode. As a result, the mobile computer may miss some cache invalidation reports. In this paper, we present an energy-efficient cache invalidation method for a wireless mobile computer. The new cache invalidation scheme is called grouping with cold update-set retention (GCORE). Upon waking up, a mobile computer checks its cache validity with the server. To reduce the bandwidth requirement for validity-checking, data objects are partitioned into groups. However, instead of simply invalidating a group if any of the objects in the group has been updated, GCORE retains the cold update set of objects in a group if possible. We present an efficient implementation of GCORE and conduct simulations to evaluate its caching effectiveness. The results show that GCORE can subs...
Efficient Data Mining for Path Traversal Patterns.
Abstract—In this paper, we explore a new data mining capability that involves mining path traversal patterns in a distributed information-providing environment where documents or objects are linked together to facilitate interactive access. Our solution procedure consists of two steps. First, we derive an algorithm to convert the original sequence of log data into a set of maximal forward references. By doing so, we can filter out the effect of some backward references, which are mainly made for ease of traveling and concentrate on mining meaningful user access sequences. Second, we derive algorithms to determine the frequent traversal patterns¦i.e., large reference sequences¦from the maximal forward references obtained. Two algorithms are devised for determining large reference sequences; one is based on some hashing and pruning techniques, and the other is further improved with the option of determining large reference sequences in batch so as to reduce the number of database scans required. Performance of these two methods is comparatively analyzed. It is shown that the option of selective scan is very advantageous and can lead to prominent performance improvement. Sensitivity analysis on various parameters is conducted. Index Terms—Data mining, traversal patterns, distributed information system, World Wide Web, performance analysis.
Mining Association Rules with Adjustable Accuracy.
In this paper, we devise efficient algorithms for mining association rules with adjustable accuracy. It is noted that several applications require mining the transaction data to capture the customer behavior frequently. In those applications, the efficiency of data mining could be a more important factor than the requirement for complete accuracy of the mining results. Allowing imprecise results can significantly improve the data mining efficiency. In this paper, two methods for mining association rules with adjustable accuracy are developed. By dealing with the concept of sampling, both methods obtain some essential knowledge from a sampled subset first, and in light of that knowledge, perform efficient association rule mining on the entire database. A technique of relaxing the support factor based on the sampling size is devised to achieve the desired level of accuracy. These two methods differ from each other in their ways of utilizing the sampled data. Performance of these two meth...
Indexed Sequential Data Broadcasting in Wireless Mobile Computing.
Energy saving is one of the most important issues in wireless mobile computing. Among others, one viable approach to achieving energy saving is to use an indexed data organization to broadcast data over wireless channels to mobile units. In this paper, we explore the issue of indexing data with skewed access for sequential broadcasting in wireless mobile computing. We propose methods to build index trees based on access frequencies of data records. To minimize the average cost of index probes, we consider two cases: one for fixed index fanouts and the other for variant index fanouts, and devise algorithms to construct index trees for both cases. We show that the cost of index probes can be minimized not only by employing an imbalanced index tree that is designed in accordance with data access skew, but also by exploiting variant fanouts for index nodes. 1 Introduction  Mobile computing, referring to the activity of using personal digital assistances, such as palmtops and notebook compu...
Optimal Design of Multiple Hash Tables for Concurrency Control.

Using a Hash%2DBased Method with Transaction Trimming for Mining Association Rules.


Parallel Execution of Hash Joins in Parallel Databases.
In this paper we explore two important issues, processor allocation and the use of hash filters,  to improve the parallel execution of hash joins. To exploit the opportunity of pipelining for hash  join execution, a scheme to transform a bushy execution tree to an allocation tree is first devised.  In an allocation tree, each node denotes a pipeline. Then, using the concept of synchronous  execution time, processors are allocated to the nodes in the allocation tree in such a way that  inner relations in a pipeline can be made available approximately the same time. Also, the  approach of hash filtering is investigated to further improve the parallel execution of hash joins.  Extensive performance studies are conducted via simulation to demonstrate the importance of  processor allocation and to evaluate various schemes using hash filters. It is experimentally  shown that processor allocation is in general the dominant factor to performance, and the effect  of hash filtering becomes more ...

On Applying Hash Filters to Improving the Execution of Multi%2DJoin Queries.
.&lt;F3.733e+05&gt; In this paper, we explore an approach of interleaving a bushy execution tree with hash filters to improve the execution of multi-join queries. Similar to semi-joins in distributed query processing, hash filters can be applied to eliminate non-matching tuples from joining relations before the execution of a join, thus reducing the join cost. Note that hash filters built in different execution stages of a bushy tree can have different costs and effects. The effect of hash filters is evaluated first. Then, an efficient scheme to determine an effective sequence of hash filters for a bushy execution tree is developed, where hash filters are built and applied based on the join sequence specified in the bushy tree so that not only is the reduction effect optimized but also the cost associated is minimized. Various schemes using hash filters are implemented and evaluated via simulation. It is experimentally shown that the application of hash filters is in general a very powerful ...
Efficient Data Mining for Path Traversal Patterns in Distributed Systems.

Energy%2DEfficient Caching for Wireless Mobile Computing.

Stream Conversion to Support Interactive Video Playout.

On Coupling Multiple Systems With A Global Buffer.
In this paper, we conduct a performance study of coupling multiple systems with a global buffer, and present several results obtained from a multiple-system simulator. This simulator has been run against three workloads, and the coupled system behavior with these three different inputs is studied. Several statistics, including those on local and global buffer hits, page writes to the global buffer, cross-invalidations and castouts, and their relationship to the degree of data skew is explored. Moreover, in addition to the update-caching approach, a design alternative for the use of a global buffer, namely read-caching, is explored. In read-caching, not only updated pages but also pages read by each node are kept in the global buffer, thereby facilitating other nodes&#039; access to the same pages at the cost of a higher global buffer usage. Also investigated is the case of no-caching, i.e., without using a global buffer. Several simulation results are presented and analyzed. Index Terms: Da...
Optimization of Parallel Execution for Multi%2DJoin Queries.
In this paper, we study the subject of exploiting inter-operator parallelism to optimize the execution of multi-join queries. Specifically, we focus on two major issues: (i) scheduling the execution sequence of multiple joins within a query, and (ii) determining the number of processors to be allocated for the execution of each join operation obtained in (i). For the first issue, we propose and evaluate by simulation several methods to determine the general join sequences, or bushy trees. Despite their simplicity, the heuristics proposed can lead to the general join sequences which significantly outperform the optimal sequential join sequence. The quality of the join sequences obtained by the proposed heuristics is shown to be fairly close to that of the optimal one. For the second issue, it is shown that the processor allocation for exploiting inter-operator parallelism is subject to more constraints, such as execution dependency and system fragmentation, than those in the study of in...
On the Complexity of Distributed Query Optimization.

Data Mining An Overview from a Database Perspective.

Performance Analysis of Dynamic Finite Versioning Schemes Storage Cost vs. Obsolescence.

On General Results for All%2Dto%2DAll Broadcast.
All-to-all broadcast refers to the process by which every node broadcasts its certain piece of information to all other nodes in the system. In this paper, we develop all-to-all broadcast schemes by dealing with two classes of schemes. A prior scheme based on generation of minimal complete sets is first described, and then a new scheme based on propagation of experts is developed. The former always completes the broadcasting in the minimal number of steps and the latter is designed to minimize the number of messages. Performance of these two classes of schemes is comparatively analyzed. The all-to-all broadcast scheme desired can be derived by combining the advantages of these two classes of schemes.  Index Terms: All-to-all broadcast, message passing, NODUP, expert propagation, communication steps.  1 Introduction Instead of using a shared memory and a global clock, the synchronization and communication between the processing nodes in a distributed system can be done via message pass...
Using Content%2DBased Search to Download Digital Video into a Client Station.

Using Rotational Mirrored Declustering for Replica Placement in a Disk%2DArray%2DBased Video Server.
In a video-on-demand (VOD) environment, disk-arrays are often used to support the disk bandwidth requirement. This can pose serious problems on available disk bandwidth upon disk failure. In this paper, we explore the approach of replicating frequently accessed movies to provide high data bandwidth and fault-tolerance required in a disk-array-based video server. An isochronous continuous video stream imposes different requirements from a random access pattern on databases or files. Explicitly, we propose a new replica placement method, called  rotational mirrored declustering (RMD), to support high data availability for disk arrays in a VOD environment. In essence, RMD is similar to the conventional mirrored declustering in that replicas are stored in different disk arrays, however different from the latter in that the replica placements in different disk arrays under RMD are properly rotated. Combining the merits of prior chained and mirrored declustering methods, RMD is particularly ...
Efficient Parallel and Data Mining for Association Rules.
In this paper, we develop an algorithm, called PDM, to conduct parallel data mining for association rules. Consider a transaction as a collection of items, and a large itemset is a set of items such that the number of transactions containing it exceeds a pre-specified threshold. PDM is so designed that the global set of large itemsets can be identified efficiently and the amount of inter-node data exchange required is minimized. Specifically, with a given database partition, each processing node will collect (count) information on each itemset from its local database efficiently via a hashing method. The information discovered by each node is next shared with other nodes via some communication schemes. Then, PDM employs a technique, called clue-andpoll, to address the uncertainty due to the partial knowledge collected at each node by judiciously selecting a small fraction of the itemsets for the exchange of count information among nodes, thus reducing the communication cost. The global...
Downloading and Stream Conversion Supporting Interactive Playout of Videos in a Client Station.

An Effective Hash Based Algorithm for Mining Association Rules.
In this paper, we examine the issue of mining association rules among items in a large database of sales transactions. The mining of association rules can be mapped into the problem of discovering large itemsets where a large itemset is a group of items which appear in a sufficient number of transactions. The problem of discovering large itemsets can be solved by constructing a candidate set of itemsets first and then, identifying, within this candidate set, those itemsets that meet the large itemset requirement. Generally this is done iteratively for each large k-itemset in increasing order of k where a large k-itemset is a large itemset with k items. To determine large itemsets from a huge number of candidate large itemsets in early iterations is usually the dominating factor for the overall data mining performance. To address this issue, we propose an effective hash-based algorithm for the candidate set generation. Explicitly, the number of candidate 2-itemsets generated by the proposed algorithm is, in orders of magnitude, smaller than that by previous methods, thus resolving the performance bottleneck. Note that the generation of smaller candidate sets enables us to effectively trim the transaction database size at a much earlier stage of the iterations, thereby reducing the computational cost for later iterations significantly. Extensive simulation study is conducted to evaluate performance of the proposed algorithm. 1
Applying Segmented Right%2DDeep Trees to Pipelining Multiple Hash Joins.
The pipelined execution of multijoin queries in a multiprocessor-based database system is explored in this paper. Using hash-based joins, multiple joins can be pipelined so that the early results from a join, before the whole join is completed, are sent to the next join for processing. The execution of a query is usually denoted by a query execution tree. To improve the execu-tion of pipelined hash joins, an innovative approach on query execution tree selection is proposed to exploit segmented right-deep trees, which are bushy trees of right-deep subtrees. We first derive an analytical mode1 for the execution of a pipeline segment, and then, in light of the model, develop heuristic schemes to de-termine the query execution plan based on a segmented right-deep tree so that the query can be efficiently executed. As shown by our simulation, the proposed approach, without incurring additional overhead on plan execution, possesses more flexibility in query plan generation, and can lead to query plans of better performance than those achievable by the previous schemes using right-deep trees. 
A Hierarchical Approach to Parallel Multiquery Scheduling.

Storage and Retrieval Methods to Support Fully Interactive Playout in a Disk%2DArray%2DBased Video Server.
One of the most important challenges in a video--on--demand (VOD) system is to support interactive browsing functions such as &#034;fast forward&#034; and &#034;fast backward.&#034; Typically, these functions impose additional resource requirements on the VOD system in terms of storage space, retrieval throughput, network bandwidth, etc. Moreover, prevalent video compression techniques such as MPEG impose additional constraints on the process since they introduce inter-frame dependencies. In this paper, we devise methods to support variable rate browsing for MPEG-like video streams and minimize the additional resources required. Specifically, we consider the storage and retrieval for video data in a disk-array-based video server and address the issue of distributing the retrieval requests across the disks evenly. The overall approach proposed in this paper for interactive browsing is composed of (1) a storage method, (2) sampling and placement methods, and (3) a playout method, where the sampling and plac...
Support for Fully Interactive Playout in Disk%2DArray%2DBased Video Server.

On Parallel Transaction Processing in a Coupled System.
In this paper, we conduct a performance study on parallel transaction processing in a coupled system, where a coupled system is a multi-node system with a shared global buffer. We develop a multiplesystem simulator and obtain several performance results from it. This simulator has been run against three workloads, and the coupled system behavior with these three different inputs is studied. Several statistics, including those on local and global buffer hits, page writes to the global buffer, cross-invalidations and castouts, are comparatively analyzed, and their relationship to the degree of data skew is explored. 1 Introduction  Due mainly to the rapid technology advances, it has recently become very attractive to couple multiple systems for database transaction processing in order to address the increasing demand for better capacity, availability and cost-performance. Among others, one method to couple multiple systems is the data sharing approach [3] [6] [16], which is also referred...
Scheduling Multiple Queries on a Parallel Machine.
There has been a good deal of progress made recently towards the efficient parallelization of individual phases of single queries in multiprocessor database systems. In this paper we devise and evaluate a number of scheduling algorithms designed to handle multiple parallel queries. One of these algorithms emerges as a clear winner. This algorithm is hierarchical in nature: In the first phase, a good quality precedence-based schedule is created for each individual query and each possible number of processors. This component employs dynamic programming. In the second phase, the results of the first phase are used to create an overall schedule of the full set of queries. This component is based on previously published work on nonprecedence-based malleable scheduling. Even though the problem we are considering is NP-hard in the strong sense, the multiple query schedules generated by our hierarchical algorithm are seen experimentally to achieve results which are close to optimal.  1 Introdu...
On Parallel Execution of Multiple Pipelined Hash Joins.
In this paper we study parallel execution of multiple pipelined hash joins. Specifically, we deal with two issues, processor allocation and the use of hash filters, to improve parallel execution of hash joins. We first present a scheme to transform a bushy execution tree to an allocation tree, where each node denotes a pipeline. Then, processors are allocated to the nodes in the allocation tree based on the concept of synchronous execution time such that inner relations (i.e., hash tables) in a pipeline can be made available approximately the same time. In addition, the approach of hash filtering is investigated to further improve the overall performance. Performance studies are conducted via simulation to demonstrate the importance of processor allocation and to evaluate various schemes using hash filters. Simulation results indicate that processor allocation based on the allocation tree significantly outperforms that based on the original bushy tree, and that the effect of hash filte...
On Index Selection Schemes for Nested Object Hierarchies.
In this paper we address the problem of devising a set of indexes for a nested object hierarchy in an object-oriented database to improve the overall system performance. It is noted that the effects of two indexes could be entangled in that the inclusion of one index might affect the benefit achievable by the other index. Such a phenomenon is termed index interaction. Clearly, the effect of index interaction needs to be taken into consideration when a set of indexes is being built. The index selection problem is first formulated and four index selection algorithms are evaluated via simulation. The effects of different objective functions, which guide the search in the index selection algorithms, are also investigated. It is shown by simulation results that the greedy algorithm which is devised in light of the phenomenon of index interaction performs fairly well in most cases. Sensitivity analysis for various database parameters is conducted. Index Term: Object-oriented databases, indexing, nested object hierarchy, index interaction.
A Graph Theoretical Approach to Determine a Join Reducer Sequence in Distributed Query Processing.

Optimal NODUP All%2Dto%2DAll Broadcast Schemes in Distributed Computing Systems.

Parallel Query Processing.
With relations growing larger and queries becoming more complex, parallel query processing is an increasingly attractive option for improving the performance of database systems. The objective of this paper is to examine the various issues encountered in parallel query processing and the techniques available for addressing these issues. The focus of the paper is on the join operation with both sort-merge join and hash joins being considered. Three types of parallelism can be exploited, namely intra-operator, inter-operator, and inter-query parallelism. In intra-operator parallelism the major issue is task creation, and the objective is to split a join operation into tasks in a manner such that the load can be spread evenly across a given number of processors. This is a challenge when the values on the join attribute are not uniformly distributed. Inter-operator parallelism can be achieved either through parallel execution of independent operations or through pipelining. In either case,...
Decentralized Consensus Protocols with Multi%2DPort Communication.
We develop in this paper efficient decentralized consensus protocols for a distributed system with multiport communication. Given an arbitrary number of nodes in a system, the proposed protocols can reach the consensus in the minimal numbers of message steps. Specifically, we develop two classes of decentralized consensus protocols: the one without an initiator  and the one with an initiator. We first present the case of 1-port communication, i.e., each node can send out one message in one step, and show algorithms G 1 and G 2 . We then develop our results for the case of multi-port communication, say k-port communication, meaning that each node can send out k messages in one step, and derive algorithms G 3 and G 4 . G 3 and G 4 are the general versions of G 1 and G 2 . The four algorithms presented in this paper are optimal in the sense that they complete the protocols in the minimal number of message steps required. The number of messages incurred by each algorithm is also derived. 1...
Dynamic Finite Versioning An Effective Versioning Approach to Concurrent Transaction and Query Processing.
Severe data contention may exist between short update transactions and long read-only queries if both are to access the same database through a conventional concurrency control method. In this paper, we present dynamic finite versioning (DFV) schemes to effectively support concurrent processing of transactions and queries. Without acquiring locks, queries read from a small, fixed number of dynamically derived, transaction-consistent, but maybe slightly obsolete,  logical snapshots of the database. On the other hand, transactions access the most up-to-date data in the database without data contention from queries. Intermediate versions created between snapshots are automatically discarded. Furthermore, dirty pages updated by active transactions are allowed to be written back into the database before commitment (i.e., the STEAL policy), and at the same time, consistent logical snapshots can be advanced automatically without quiescing the ongoing transactions or queries. 1 Introduction  C...
On Optimal Processor Allocation to Support Pipelined Hash Joins.
In this paper, we develop algorithms to achieve optimal processor allocation for pipelined hash joins in a multiprocessorbased database system. A pipeline of hash joins is composed of several stages, each of which is associated with one join operation. The whole pipeline is executed in two phases: (1) the table-building phase, and (2) the tuple-probing phase. We focus on the problem of allocating processors to the stages of a pipeline to minimize the query execution time. We formulate the processor allocation problem as a twophase mini-max optimization problem, and develop three optimal allocation schemes under three different constraints. The effectiveness of our problem formulation and solution is verified through a detailed tuple-by-tuple simulation of pipelined hash joins. Our solution scheme is general and applicable to any optimal resource allocation problem formulated as a two-phase mini-max problem. 1 Introduction  In recent years, multiprocessor-based parallel database machine...
Applying Hash Filters to Improving the Execution of Bushy Trees.
In this paper, we explore an approach of interleaving a bushy execution tree with hash filters to improve the execution of multi-join queries. The effect of hash filters is evaluated first. Then, an efficient scheme to determine an effective sequence of hash filters for a bushy execution tree is developed, where hash filters are built and applied based on the join sequence specified in the bushy tree so that not only is the reduction effect optimized but also the cost associated is minimized. Various schemes using hash filters are implemented and evaluated via simulation. It is experimentally shown that the application of hash filters is in general a very powerful means to improve the execution of multi-join queries, and the improvement becomes more prominent as the number of relations in a query increases. 1 Introduction  In relational database systems, joins are the most expensive operations to execute. Applications involving decision support and complex objects usually have to speci...
Combining Join and Semi%2DJoin Operations for Distributed Query Processing.

Grouped Sweeping Scheduling for DASD%2Dbased Multimedia Storage Management.

Efficient Decentralized Consensus Protocols in a Distributed Computing System.

Scheduling and Processor Allocation for Parallel Execution of Multi%2DJoin Queries.

Performance Analysis of Dynamic Finite Versioning for Concurrency Transaction and Query Processing.
In this paper, we analyze the performance of dynamic finite versioning (DFV) schemes for concurrent transaction and query processing, where a finite number of consistent snapshots can be derived for query access. We develop analytical models based on a renewal process approximation to evaluate the performance of DFV using M  2 snapshots. The storage overhead and obsolescence faced by queries are measured. Simulation is used to validate the analytical models and to evaluate the trade-offs between various strategies for advancing snapshots when M ? 2. The results show that (1) the analytical models match closely with simulation; (2) both the storage overhead and obsolescence are sensitive to the snapshot-advancing strategies, especially for M ? 2 snapshots; and (3) generally speaking, increasing the number of snapshots demonstrates a trade-off between storage overhead and query obsolescence. For cases with skewed access or low update rates, a moderate increase in the number of snapshots ...
Using Segmented Right%2DDeep Trees for the Execution of Pipelined Hash Joins.
In this paper, we explore the execution of pipelined hash joins in a multiprocessor-based database system. To improve the query execution, an innovative ap-proach on query execution tree selection is proposed to exploit segmented right-deep trees, which are bushy trees of right-deep subtrees. We first derive an analyt-ical model for the execution of a pipeline segment, and then, in light of the model, develop heuristic schemes to determine the query execution plan based on a seg-mented right-deep tree so that the query can be ef-ficiently executed. As shown by our simulation, the proposed approach, without incurring additional over-head on plan execution, possesses more flexibility in query plan generation, and leads to query plans of sig-nificantly better performance than those achievable by the previous schemes using right-deep trees. 1
Interleaving a Join Sequence with Semijoins in Distributed Query Processing.
In distributed query processing, the conventional approach to reduce the amount of data transmission is to first apply a sequence of semijoins as &#034;reducers&#034; and then ship the resultant relations to the final site to carry out the join operations. Recently, it has been shown that the approach of applying a combination of joins and semijoins as reducers can lead to substantially larger reduction on data transmission required. In this paper, we develop an efficient heuristic approach to determine an effective sequence of semijoin and join reducers. Semijoins whose execution will reduce the amount of data transmission required to perform a join sequence are termed beneficial semijoins for that join sequence. Note that beneficial semijoins include the conventional profitable semijoins and the gainful semijoins that are not profitable themselves but become beneficial due to the inclusion of join reducers. This type of dependency between semijoin and join reducers complicates the identificati...
On Workload Characterization of Relational Database Environments.
As relational database systems become increasingly popular, there is a clear need to better understand the workload so systems can be designed or tuned more effectively. A RElational Database Workload AnalyzeR (REDWAR) is developed to characterize the workload in a DB2 environment. This is applied to study a production DB2 system where an SQL trace for a two hour interval and an image copy of the database catalog were obtained. The results of the workload study are summarized. Here we focus on the structure and complexity of SQL statements, the makeup and run-time behavior of transactions/queries, and the composition of relations and views. The results obtained provide the important information needed to build a benchmark workload to evaluate alternative design trade-offs of database systems.  Index Terms: relational databases, workload characterization, DB2.  1 Introduction  As relational database systems grow increasingly popular, throughput and response time requirements are becomin...
Determining Beneficial Semijoins for a Join Sequence in Distributed Query Processing.

Optimal All%2Dto%2DAll Broadcasting Schemes in Distributed Systems.

Using Join Operations as Reducers in Distributed Query Processing.

Using Combination of Join and Semijoin Operations for Distributed Query Processing.

On Workload Characterization of Relational Database Environments.
As relational database systems become increasingly popular, there is a clear need to better understand the workload so systems can be designed or tuned more effectively. A RElational Database Workload AnalyzeR (REDWAR) is developed to characterize the workload in a DB2 environment. This is applied to study a production DB2 system where an SQL trace for a two hour interval and an image copy of the database catalog were obtained. The results of the workload study are summarized. Here we focus on the structure and complexity of SQL statements, the makeup and run-time behavior of transactions/queries, and the composition of relations and views. The results obtained provide the important information needed to build a benchmark workload to evaluate alternative design trade-offs of database systems.  Index Terms: relational databases, workload characterization, DB2.  1 Introduction  As relational database systems grow increasingly popular, throughput and response time requirements are becomin...
Addressing%2C Routing%2C and Broadcasting in Hexagonal Mesh Multiprocessors.
family of 6-regular graphs, called hexagonal meshes or H-meshes, is considered n H as a multiprocessor interconnection network. Processing nodes on the periphery of a -mesh are first wrapped around to achieve regularity and homogeneity. The diameter of a wrapped H-mesh is shown to be of O(p ), where p is the number of nodes in the  1/2  o t H-mesh. An elegant, distributed routing scheme is developed for wrapped H-meshes s hat each node in an H-mesh can compute shortest paths from itself to any other node p with a straightforward algorithm of O(1) using the addresses of the source-destination air only, i.e., independent of the network&#039;s size. This is in sharp contrast with those d previously known algorithms that rely on using routing tables. Furthermore, we also evelop an efficient point-to-point broadcasting algorithm for the H-meshes, which is proved to be optimal in the number of required communication steps. The wrapped H-meshes are compared against some other existing multiprocess...
On the Number of Acceptable Task Assignments in Distributed Computing Systems.
n a distributed computing system, a job is usually decomposed into several cooperating - l tasks which are then assigned to a set of processors in the system to exploit the inherent paral elism in job execution. The distributed computing system and cooperating tasks can be . represented by a processor graph G = (V , E ) and a task graph G = (V , E ), respectively P P P T T T  A T n edge between a pair of nodes in G represents the existence of direct communications G between the two corresponding tasks. The maximal number of hops between two processors in to which two adjacent tasks in G are assigned is called the dilation of that assignment. F  P T  or obvious reasons, it is important to keep the communication delay between any two adjat cent tasks in G low. This can be accomplished by keeping the dilation of an assignmen T  below some specified value. An assignment is said to be acceptable if its dilation is less than or equal to the specified value. Characterization and use of the nu...
Adaptive Fault%2DTolerant Routing in Hypercube Multicomputers.
A connected hypercube with faulty links and/or nodes is called an injured hypercube. To enable any non-faulty node to communicate with any other non-faulty node in an injured hypcrcube, the information on component failures has to be made available to non-faulty nodes so as to route messages around the faulty components. We propose first a distributed adaptive fault-tolerant routing scheme for an injured hypercube in which each node is required to know only the condition of its own links. Despite its simplicity, this scheme is shown to be capable of routing messages successfully in an injured hypercube as long as the number of faulty components is less than n. Moreover, it is proved that this scheme routes messages via shortest paths with a rather high probability and the expected length of a resulting path is very close to that of a shortest path. Since the assumption that the number of faulty components is less than n in an n-dimensional hypercube might limit the usefulness of the above scheme, we also introduce a routing scheme based on depth-first search which works in the presence of an arbitrary number of faulty components. Due to the insufficient information on faulty components, however, the paths chosen by the above scheme may not always be the shortest. To guarantee all messages to be routed via shortest paths, we propose to equip every node with more information than that on its own links. The effects of this additional information on routing efficiency are analyzed, and the additional information to be kept at each node for the shortest path routing is determined. Several examples and remarks are also given to illustrate bur results. Index Terms: Injured and regular hypercubes, distributed adaptive fault-tolerant routing, dcpthfirst search, looping effects, network delay tables, failure information.
Subcube Allocation and Task Migration in Hypercube Multiprocessors.

Depth%2DFirst Search Approach for Fault%2DTolerant Routing in Hypercube.

Task Migration in Hypercube Multiprocessors.

On Relaxed Squashed Embedding of Graphs into a Hypercube.

Processor Allocation in an N%2DCube Multiprocessor Using Gray Codes.

Performance Analysis of Distributed Routing Strategies Free of Ping%2DPong%2DType Looping.

